quotient graph造句

• Since the partition classes are disjoint, their adjacencies constitute a new graph, a "'quotient graph "'
• Each internal node of the split decomposition tree of a graph is associated with a graph, called the quotient graph for node.
• Every quotient graph has one of three forms : it may be a prime graph, a complete graph, or a star.
• Thus the more interesting tree lattices are the non-uniform ones, equivalently those for which the quotient graph \ Gamma \ backslash T is infinite.
• Therefore, the edges of " G " can be reconstructed given only the quotient graph " G / P " and its factors.
• It is known that an action of " G " on " X " is trivial if and only if the quotient graph of groups for that action is trivial.
• The quotient graph can be formed by deleting from the tree, forming subsets of vertices in corresponding to the leaves in each of the resulting subtrees, and collapsing each of these vertex sets into a single vertex.
• For a discrete subgroup " G " of the automorphism group of a locally finite tree " X " one can define a natural notion of " volume " for the quotient graph of groups "'A "'as
• A graph may have exponentially different splits, but they are all represented in the split decomposition tree, either as an edge of the tree ( for a strong split ) or as an arbitrary partition of a complete or star quotient graph ( for a split that is not strong ).